منابع مشابه
modular chromatic number of $c_m square p_n$
a modular $k$-coloring, $kge 2,$ of a graph $g$ without isolated vertices is a coloring of the vertices of $g$ with the elements in $mathbb{z}_k$ having the property that for every two adjacent vertices of $g,$ the sums of the colors of the neighbors are different in $mathbb{z}_k.$ the minimum $k$ for which $g$ has a modular $k-$coloring is the modular chromatic number of $g.$ except for some s...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملThe chromatic number of the square of the 8-cube
A cube-like graph is a Cayley graph for the elementary abelian group of order 2n. In studies of the chromatic number of cube-like graphs, the kth power of the n-dimensional hypercube, Qn, is frequently considered. This coloring problem can be considered in the framework of coding theory, as the graph Qn can be constructed with one vertex for each binary word of length n and edges between vertic...
متن کاملThe chromatic number of the square of subcubic planar graphs
Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most 3 is 7-colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations. Mathematics Subject Classification: Primary 05C15; Secondary 05C10, 68R10.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.09.003